منابع مشابه
Security Games and Combinatorial Optimization
• Set of defender pure strategies, denoted as E . We will use e(∈ E) to denote a generic pure strategy. Crucially, any e can be viewed as a subset of [n], denoting the protected (a.k.a., covered) targets by this pure strategy. In particular, the defender has multiple security resources; One pure strategy is a feasible allocation of these resources – e is precisely the set of covered targets in ...
متن کاملUniversally Balanced Combinatorial Optimization Games
This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization programs, possibly combinatorial, that is subject to integer constraints. In economic settings, the integer requirement reflects some forms of indivis...
متن کاملCombinatorial Optimization Games Arise in Social Networks
Recently, the dynamic processes for the diffusion of influence has attracted significant interest from algorithmic researchers. Over the past ten years, the following viral marketing problem has attracted a significant amount of interest. Assume we want to promote a new product over a given social network and wish this product will be adopted by most people in this network. We can initialize th...
متن کاملAlgorithms and Complexity in Combinatorial Optimization Games
We introduce an integer programming formulation for a class of combinatorial optimization games, which includes many interesting problems on graphs. We prove a simple (but very useful) theorem that the core, an important solution concept in cooperative game theory that no subset of players should be able to gain advantage by breaking away from the collective decision of all playerss40, 45], is ...
متن کاملCombinatorial Optimization for Infinite Games on Graphs
Björklund, H. 2005. Combinatorial Optimization for Infinite Games on Graphs. Acta Universitatis Upsaliensis. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 3. vi, 51 pp. Uppsala. ISBN 91-554-6129-8 Games on graphs have become an indispensable tool in modern computer science. They provide powerful and expressive models for numerous phenomena a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1993
ISSN: 0898-1221
DOI: 10.1016/0898-1221(93)90278-4